The disjunctive procedure and blocker duality
نویسندگان
چکیده
منابع مشابه
The disjunctive procedure and blocker duality
In this paper we define a disjunctive procedure over blocking type polyhedra with vertices in [0, 1], study its properties, and analize its behavior under blocker duality. We compare the indices of the procedure over a pair of blocking clutter polyhedra, obtaining that they coincide.
متن کاملNote on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, "The disjunctive procedure and blocker duality"
Aguilera et al. [DiscreteAppl.Math. 121 (2002) 1–13] give a generalization of a theorem of Lehman through an extension P̄j of the disjunctive procedure defined by Balas, Ceria and Cornuéjols. This generalization can be formulated as (A) For every clutter C, the disjunctive index of its set covering polyhedron Q(C) coincides with the disjunctive index of the set covering polyhedron of its blocker...
متن کاملRegular Extension Semantics and Disjunctive Eshghi Kowalski Procedure
Can the elegant abductive proof procedure by Eshghi and Kowalski be extended to answer queries for disjunctive logic programs? If yes, what is the semantics that such an extended procedure computes? Several years ago, in an unpublished manuscript Dung speciied a proof procedure that embeds a form of linear resolution into the Eshghi-Kowalski procedure 3]. More recently, You et al. deened the re...
متن کاملA Top-Down Procedure for Disjunctive Well-Founded Semantics
Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming is usually named well-founded semantics. However, the issue of defining and computing the well-founded semantics for disjunctive programs and databases has proved to be far more complex and difficult than for normal logic progra...
متن کاملCH-Prolog: A Proof Procedure for Positive Disjunctive Logic Programming
The suc’ce.~ of Prolog motivat~ people to use full firstorder logic: instead of only Horn clauses as the b~is of logic programming. One of the main work in this extending is to seek proof procedure for new logic progrannning. Positive disjunctive logic programming extends Horn clause progrvanming by allowing more than one atoms re occur in the head o/’a program clause. In this paper we propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00242-6